Spectral radius of graphs with given matching number
نویسندگان
چکیده
منابع مشابه
The Laplacian spectral radius of graphs with given matching number
In this paper, we show that of all graphs of order n with matching number β, the graphs with maximal spectral radius are Kn if n = 2β or 2β + 1; K2β+1 ∪Kn−2β−1 if 2β + 2 n < 3β + 2; Kβ ∨ Kn−β or K2β+1 ∪Kn−2β−1 if n = 3β + 2; Kβ ∨ Kn−β if n > 3β + 2, where Kt is the empty graph on t vertices. © 2006 Elsevier Inc. All rights reserved. AMS classification: 05C35; 05C50
متن کاملThe minimal spectral radius of graphs with a given diameter
The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) plays an important role in modeling virus propagation in networks. In fact, the smaller the spectral radius, the larger the robustness of a network against the spread of viruses. Among all connected graphs on n nodes the pathPn has minimal spectral radius. However, its diameter D, i.e., the maxim...
متن کاملOn the spectral radius of bipartite graphs with given diameter
Article history: Received 17 March 2008 Accepted 9 October 2008 Available online 3 December 2008 Submitted by R.A. Brualdi AMS classification: 05C50
متن کاملThe Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges
LetB(n, r) be the set of all bicyclic graphs with n vertices and r cut edges. In this paper we determine the unique graph with maximal adjacency spectral radius or signless Laplacian spectral radius among all graphs in B(n, r).
متن کاملThe signless Laplacian spectral radius of graphs with given number of cut vertices
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all connected graphs with fixed order and given number of cut vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2007
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.09.014